#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 1e5+10;
const int mod = 1004535809;
const int G = 3;

ll A[N<<2],B[N<<2],fac[N*100],inv[N*100],gn[110];
int lim,n,m,s,lg[N<<2],rev[N<<2];
ll ans;

ll qp(ll x,int t){ll res=1;for(;t;t>>=1,x=x*x%mod)if(t&1)res=res*x%mod;return res;}

ll C(int x,int y){if(x < y || x < 0 || y < 0) return 0;return fac[x] * inv[y] % mod * inv[x-y] % mod;}

ll F(int x){return C(m,x) * fac[n] % mod * qp(inv[s],x) % mod * inv[n-s*x] % mod * qp(m-x,n-s*x) % mod;}

void change(ll *f){for(int i = 1;i < n;i++) if(i < rev[i]) swap(f[i],f[rev[i]]);}

void NTT(ll *f,int on){
	change(f);
	for(int h = 2;h <= n;h <<= 1){
		ll Gn = gn[lg[h]];
		for(int i = 0;i < n;i += h){
			ll GG = 1;
			for(int j = i;j < i + h/2;j++){
				ll u = f[j],v = f[j + h/2] * GG % mod; GG = Gn * GG % mod;
				f[j] = (u + v) % mod; f[j + h/2] = (u - v + mod) % mod;
			}
		}
	}
	if(on == -1){reverse(f+1,f+n); ll iinv = qp(n,mod-2); for(int i = 0;i < n;i++) f[i] = f[i] * iinv % mod;}	
}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in,s = in; lim = min(m,n/s);
	for(int i = (fac[0] = 1);i <= max(n,m);i++) fac[i] = fac[i-1] * i % mod; inv[max(n,m)] = qp(fac[max(n,m)],mod-2);
	for(int i = m(n,m)-1;i >= 0;i--) inv[i] = inv[i+1] * (i+1) % mod;
	for(int i = 0;i <= lim;i++) A[i] = F(i) * fac[i] % mod;
	for(int i = 0;i <= lim;i++) B[i] = ((i & 1 ? -1 : 1) * inv[i] % mod + mod) % mod;
	reverse(A,A+lim+1);  for(n = 1;n < lim * 2 + 2;n <<= 1); 
	for(int i = 1;i < n;i++) rev[i] = (rev[i>>1]>>1) | (i & 1 ? n >> 1 : 0);
	for(int h = 1;h <= n;h <<= 1) lg[h] = lg[h>>1] + 1,gn[lg[h]] = qp(G,(mod-1)/h) % mod;
	NTT(A,1); NTT(B,1); for(int i = 0;i < n;i++) A[i] = A[i] * B[i] % mod;
	NTT(A,-1); reverse(A,A+lim+1); for(int i = 0;i <= lim;i++) A[i] = A[i] * inv[i] % mod;
	for(int i = 0,w;i <= lim;i++) w = in,ans = (ans + A[i] * w % mod) % mod;
	printf("%lld\n",ans);
	return 0;
}
